Saturated Particle Filter: Almost sure convergence and improved resampling
نویسندگان
چکیده
Nonlinear stochastic dynamical systems are widely used to model physical processes. In many practical applications, the state variables are defined on a compact set of the state space, i.e., they are bounded or saturated. To estimate the states of systems with saturated variables, the Saturated Particle Filter (SPF) has recently been developed. This filter exploits the structure of the saturated system using a specific importance sampling distribution. In this paper we investigate the asymptotic properties of the filter, in particular its almost sure convergence to the true posterior PDF. Furthermore, an improved SPF is developed that uses a novel resampling procedure to overcome the practical shortcomings of the original SPF. We prove that this new filter also converges almost surely to the true posterior PDF. Both versions of the SPF are presented in easy to implement algorithmic forms.
منابع مشابه
An Efficient Target Tracking Algorithm Based on Particle Filter and Genetic Algorithm
In this paper, we propose an efficient hybrid Particle Filter (PF) algorithm for video tracking by employing a genetic algorithm to solve the sample impoverishment problem. In the presented method, the object to be tracked is selected by a rectangular window inside which a few numbers of particles are scattered. The particles’ weights are calculated based on the similarity between feature vecto...
متن کاملON THE ALMOSTLY SURE CONVERGENCE OF THE SEQUENCE D_P,Q
In this paper, we will discuss the concept of almost sure convergence for specic groups of fuzzyrandom variables. For this purpose, we use the type of generalized Chebyshev inequalities.Moreover, we show the concept of almost sure convergence of weighted average pairwise NQDof fuzzy random variables.
متن کاملTHE ALMOST SURE CONVERGENCE OF WEIGHTED SUMS OF NEGATIVELY DEPENDENT RANDOM VARIABLES
In this paper we study the almost universal convergence of weighted sums for sequence {x ,n } of negatively dependent (ND) uniformly bounded random variables, where a, k21 is an may of nonnegative real numbers such that 0(k ) for every ?> 0 and E|x | F | =0 , F = ?(X ,…, X ) for every n>l.
متن کاملAdaptive particle routing in parallel/distributed particle filters
Particle filters estimate the state of dynamic systems through Bayesian interference and stochastic sampling techniques. Parallel/distributed particle filters aim to improve the performance by deploying all particles on different processing units. However, the communication cost of transferring particles is high due to the centralized processing in resampling step. To reduce the communication c...
متن کاملDistributed SLAM Using Improved Particle Filter for Mobile Robot Localization
The distributed SLAM system has a similar estimation performance and requires only one-fifth of the computation time compared with centralized particle filter. However, particle impoverishment is inevitably because of the random particles prediction and resampling applied in generic particle filter, especially in SLAM problem that involves a large number of dimensions. In this paper, particle f...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Automatica
دوره 49 شماره
صفحات -
تاریخ انتشار 2013